Computational efficiency and universality of timed P systems with membrane creation
نویسندگان
چکیده
منابع مشابه
Computational efficiency and universality of timed P systems with active membranes
P systems are a class of computational models inspired by the structure and the functioning of a living cell. In the semantics of P systems, there exists a global clock, which marks the time for the system, and the execution time of each rule takes exactly one time unit. However, in living cells, the execution time of different biochemical reactions is depended on many uncontrollable factors, a...
متن کاملOn P Systems with Membrane Creation
We first give a general result about P systems with symbolobjects, which says that systems with membrane creation with only one initial membrane can simulate usual systems without using additional membranes (and this implies as a direct consequence a recent result of Mutyam and Krithivasan), then we extend the membrane creation feature to P systems with stringobjects and we prove the computatio...
متن کاملSampled Universality of Timed Automata
Timed automata can be studied in not only a dense-time setting but also a discrete-time setting. The most common example of discrete-time semantics is the so called sampled semantics (i.e., discrete semantics with a xed time granularity "). In the real-time setting, the universality problem is known to be undecidable for timed automata. In this work, we study the universality question for the l...
متن کاملUniversality of Enzymatic Numerical P systems
P systems represent a computational paradigm inspired by the cell architecture and functioning. Several classes of P systems have been introduced in the framework of membrane computing [11]. Numerical P systems (NP systems) are a type of P systems, inspired by the cell structure, in which numerical variables evolve inside the compartments by means of programs; a program (or rule) is composed of...
متن کاملComputational Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It however yields a new definition for cel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2015
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-015-1732-3